Fundamental limits of caching: Improved rate-memory trade-off with coded prefetching
نویسندگان
چکیده
منابع مشابه
Fundamental Limits of Caching: Improved Bounds with Coded Prefetching
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F , and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N ≤ K and cache capacities satisfying 1 K ≤ M ≤ N K . The propos...
متن کاملFundamental Limits of Caching: Improved Delivery Rate-Cache Capacity Trade-off
We consider a centralized coded caching system consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link. Each user is equipped with a local cache of capacity MF bits. The contents can be proactively cached into the user caches by the server over low traffic period; however, without the knowledge of the user demands. During the peak tra...
متن کاملA Note on the Fundamental Limits of Coded Caching
The fundamental limit of coded caching is investigated for the case with N = 3 files and K = 3 users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.
متن کاملFundamental Limits of Caching: Improved Bounds For Small Buffer Users
In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coinc...
متن کاملFundamental Limits of Budget-Fidelity Trade-off in Label Crowdsourcing
Digital crowdsourcing (CS) is a modern approach to perform certain large projects using small contributions of a large crowd. In CS, a taskmaster typically breaks down the project into small batches of tasks and assigns them to so-called workers with imperfect skill levels. The crowdsourcer then collects and analyzes the results for inference and serving the purpose of the project. In this work...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2018
ISSN: 0090-6778
DOI: 10.1109/tcomm.2018.2834364